Approximate strip packing: Revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strip Packing vs. Bin Packing

In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...

متن کامل

Multi-objective Strip Packing

Good algorithms exist for solving the 2D rectangular strip packing problem when the objective is to minimize the amount of wasted material. However, in some applications other criteria are also important. We describe new heuristics for strip packing that optimize not only for wastage, but also for the efficient use of the cutting equipment, by minimizing the number of independent cuts required ...

متن کامل

High Multiplicity Strip Packing

An instance of the two-dimensional strip packing problem is specified by n rectangular items, each having a width, 0 < wn ≤ 1, and height, 0 < hn ≤ 1. The objective is to place these items into a strip of width 1, without rotations, such that they are nonoverlapping and the total height of the resulting packing is minimized. In this thesis, we consider the version of the twodimensional strip pa...

متن کامل

Strip Packing with Slicing

In the strip packing problem, a given set of axis-aligned rectangles must be packed into a fixed-width strip, and the goal is to minimize the height of the strip. In this paper, we examine a variant in which each rectangle may be cut vertically into multiple slices and the slices may be packed into the strip as individual pieces. Our results are: (1) analysis of the approximation ratio of sever...

متن کامل

Incremental Move for Strip-Packing

When handling 2D packing problems, numerous incomplete and complete algorithms maintain a so-called bottomleft (BL) property: every rectangle placed in a container is propped up bottom and left. While it is easy to make a rectangle BL when it is is added in a container, it is more expensive to maintain all the placed pieces BL when a rectangle is removed. This prevents researchers from designin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2016

ISSN: 0890-5401

DOI: 10.1016/j.ic.2016.03.010